Elements of Quasiconvex Subdifferential Calculus
نویسندگان
چکیده
A number of rules for the calculus of subdifferentials of generalized convex functions are displayed. The subdifferentials we use are among the most significant for this class of functions, in particular for quasiconvex functions: we treat the Greenberg-Pierskalla’s subdifferential and its relatives and the Plastria’s lower subdifferential. We also deal with a recently introduced subdifferential constructed with the help of a generalized derivative. We emphasize the case of the sublevel-convolution, an operation analogous to the infimal convolution, which has proved to be of importance in the field of quasiconvex functions. We provide examples delineating the limits of the rules we provide.
منابع مشابه
Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
In convex programming, characterizations of the solution set in terms of the subdifferential have been investigated by Mangasarian. An invariance property of the subdifferential of the objective function is studied, and as a consequence, characterizations of the solution set by any solution point and any point in the relative interior of the solution set are given. In quasiconvex programming, h...
متن کاملCharacterizations of Quasiconvex Functions and Pseudomonotonicity of Subdifferentials
In this paper we introduce the concepts of quasimonotone maps and pseudoconvex functions. Moreover, a notion of pseudomonotonicity for multi mappings is introduced; it is shown that, if a function f is continuous, then its pseudoconvexity is equivalent to the pseudomonotonicity of its generalized subdifferential in the sense of Clarke and Rockafellar and prove that a lower semicontinuous functi...
متن کاملCharacterizations of pseudoconvex functions and semistrictly quasiconvex ones
In this paper we provide some new necessary and sufficient conditions for pseudoconvexity and semistrict quasiconvexity of a given proper extended real-valued function in terms of the Clarke-Rockafellar subdifferential. Further we extend to programs with pseudoconvex objective function two earlier characterizations of the solutions set of a set constrained nonlinear programming problem due to O...
متن کاملSome Numerical Methods for the Study of the Convexity Notions Arising in the Calculus of Variations
We propose numerical schemes to determine whether a given function is convex, polyconvex, quasiconvex, and rank one convex. These notions are of fundamental importance in the vectorial problems of the calculus of variations.
متن کاملNew results in subdifferential calculus with applications to convex optimization
Chain and addition rules of subdifferential calculus are revisited in the paper and new proofs, providing local necessary and sufficient conditions for their validity, are presented. A new product rule pertaining to the composition of a convex functional and a Young function is also established and applied to obtain a proof of Kuhn-Tucker conditions in convex optimization under minimal assumpti...
متن کامل